Search results for "Channel code"

showing 3 items of 3 documents

On the Trustworthiness of Error-Correcting Codes

2007

The use of error-correcting codes protects data against accidental or intentional errors, but to what extent can a decoded message be trusted? To answer this question, one has to take the role of the receiver. First, the maximum number of errors Lambda acceptable for decoding is fixed. With the weight distribution, the probability of false decoding can be calculated, conditioned on such a Lambda-bounded strategy. This probability is a monotonously increasing function in the channel error probability p and in the maximum number of accepted errors Lambda. Therefore, pure error detection is more trustworthy than error correction. Moreover, for sufficiently small p, codes with the lexicographic…

Channel codeTheoretical computer scienceComputer scienceContext (language use)Function (mathematics)Library and Information SciencesError detection and correctionAlgorithmDecoding methodsComputer Science::Information TheoryComputer Science ApplicationsInformation SystemsCommunication channelIEEE Transactions on Information Theory
researchProduct

Analog joint source-channel Multiple Description coding scheme over AWGN parallel channels

2011

We propose a low complexity analog joint source channel coding Multiple Description (MD) scheme for transmitting the symbols of a Gaussian source across a pair of independent AWGN channels. The outputs of these channels have each a separated receiver, whereas a third receiver has both outputs available. At the transmitter side, a pair of bandwidth-reduction analog mappings are used for joint source-channel coding. The presented scheme has the inherent advantage over digital MD schemes based on separation, that coding and decoding can be performed by using a single-letter (or symbol), a strategy that is very suitable for applications where latency originated by the digital compression and th…

Channel codeTheoretical computer scienceComputer scienceMultiple description codingVariable-length codeData_CODINGANDINFORMATIONTHEORYsymbols.namesakeShannon–Fano codingAdditive white Gaussian noisesymbolsAlgorithmDecoding methodsComputer Science::Information TheoryCommunication channelData compression2011 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)
researchProduct

Presentations of constrained systems with unconstrained positions

2005

International audience; We give a polynomial-time construction of the set of sequences that satisfy a finite-memory constraint defined by a finite list of forbidden blocks, with a specified set of bit positions unconstrained. Such a construction can be used to build modulation/error-correction codes (ECC codes) like the ones defined by the Immink-Wijngaarden scheme in which certain bit positions are reserved for ECC parity. We give a lineartime construction of a finite-state presentation of a constrained system defined by a periodic list of forbidden blocks. These systems, called periodic-finite-type systems, were introduced by Moision and Siegel. Finally, we present a linear-time algorithm for con…

[INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]finite-memory systemperiodic-finite-type (PFT) system[INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS]0102 computer and information sciences02 engineering and technologyLibrary and Information Sciences01 natural sciencesModulation coding0202 electrical engineering electronic engineering information engineeringMathematicsDiscrete mathematicsChannel codefinite-state encodermodulation codeDAWG020206 networking & telecommunicationsDirected graphDirected acyclic graphforbidden blockComputer Science ApplicationsFinite sequence010201 computation theory & mathematicscodeError detection and correctionrun-length limited (RLL) codesInformation SystemsCoding (social sciences)maximum transition run (MTR)
researchProduct